Distributional Rank Aggregation, and an Axiomatic Analysis
نویسندگان
چکیده
The rank aggregation problem has been studied with varying desiderata in varied communities such as Theoretical Computer Science, Statistics, Information Retrieval and Social Welfare Theory. We introduce a variant of this problem we call distributional rank aggregation, where the ranking data is only available via the induced distribution over the set of all permutations. We provide a novel translation of the usual social welfare theory axioms to this setting. As we show this allows for a more quantitative characterization of these axioms: which then are not only less prone to misinterpretation, but also allow simpler proofs for some key impossibility theorems. Most importantly, these quantitative characterizations lead to natural and novel relaxations of these axioms, which as we show, allow us to get around celebrated impossibility results in social choice theory. We are able to completely characterize the class of positional scoring rules with respect to our axioms and show that Borda Count is optimal in a certain sense.
منابع مشابه
On the aggregation of incomplete preferences
Assume a set of objects is given with information about their bilateral relationships, allowing for incomplete and multiple comparisons as well as different preference intensities. An axiomatic approach is applied for the problem of ranking the objects. Consistency requires the preservation of relative ranking if two sets of such preferences are aggregated. Self-consistency prohibits to assign ...
متن کاملA Novel Distance-Based Approach to Constrained Rank Aggregation
We consider a classical problem in choice theory – vote aggregation – using novel distance measures between permutations that arise in several practical applications. The distance measures are derived through an axiomatic approach, taking into account various issues arising in voting with side constraints. The side constraints of interest include non-uniform relevance of the top and the bottom ...
متن کاملRepresentation and aggregation of preferences under uncertainty
We provide a general impossibility theorem on the aggregation of preferences under uncertainty. We axiomatize in the Anscombe-Aumann setting a wide class of preferences, called rank-dependent additive preferences that includes most known models of decision under uncertainty as well as state-dependent versions of these models. We prove that aggregation is possible and necessarily linear if and o...
متن کاملOn the Measurement of Long-Term Income Inequality and Income Mobility
On the Measurement of Long-Term Income Inequality and Income Mobility This paper proposes a two-step aggregation method for measuring long-term income inequality and income mobility, where mobility is defined as an equalizer of long-term income. The first step consists of aggregating the income stream of each individual into a measure of permanent income, which accounts for the costs associated...
متن کاملAxiomatic analysis of aggregation methods for collective annotation
Crowdsourcing is an important tool, e.g., in computational linguistics and computer vision, to efficiently label large amounts of data using nonexpert annotators. The individual annotations collected need to be aggregated into a single collective annotation. The hope is that the quality of this collective annotation will be comparable to that of a traditionally sourced expert annotation. In pra...
متن کامل